-
1 edge-connected graph
Большой англо-русский и русско-английский словарь > edge-connected graph
-
2 edge-connected graph
Математика: реберно связный граф -
3 edge-connected graph
мат.English-Russian scientific dictionary > edge-connected graph
-
4 k-edge connected graph
1) Электроника: к-реберно-связный граф2) Макаров: k-реберно-связный графУниверсальный англо-русский словарь > k-edge connected graph
-
5 k-edge connected graph
English-Russian electronics dictionary > k-edge connected graph
-
6 k-edge connected graph
The New English-Russian Dictionary of Radio-electronics > k-edge connected graph
-
7 k-edge connected graph
English-Russian dictionary of electronics > k-edge connected graph
-
8 strongly cyclic edge connected graph
Универсальный англо-русский словарь > strongly cyclic edge connected graph
-
9 strongly cyclic edge connected graph
English-Russian electronics dictionary > strongly cyclic edge connected graph
-
10 strongly cyclic edge connected graph
The New English-Russian Dictionary of Radio-electronics > strongly cyclic edge connected graph
-
11 strongly cyclic edge connected graph
English-Russian dictionary of electronics > strongly cyclic edge connected graph
-
12 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph -
13 graph
1) граф2) график; кривая || строить график; вычерчивать кривую3) диаграмма || представлять в виде диаграммы4) вчт моносимвольная графема, граф•- graph of strictly partial order
- acyclic graph
- alternating graph
- alternating-composition graph
- animated bar graph
- area graph
- associated undirected graph
- atomic graph
- attachment graph
- balanced signed graph
- bar graph
- basis graph
- bicolorable graph
- bicolored graph
- bipartite graph
- block graph
- bunch graph
- Cayley's graph
- circuit closed graph
- circuit connected graph
- circuit-free graph
- clique graph
- color graph
- colored graph
- column graph
- columnar graph
- communication graph
- complete graph
- connected graph
- converse graph
- coordinate graph
- critical graph
- current graph
- cyclic graph
- data flow graph
- Desargues' graph
- descendence graph
- directed graph
- dual Y-axis graph
- Euler graph
- Eulerian graph
- even graph
- exclusion graph
- exploded pie graph
- finite graph
- flat graph
- fractal graph
- function graph
- fuzzy graph
- general graph
- graceful graph
- Hamilton graph
- Hamiltonian graph
- high/low/close/open graph
- HLCO graph
- horizontal bar graph
- identity graph
- implication graph
- infinite graph
- interaction graph
- interchange graph
- interval graph
- isomorphic graph
- k-chromatic graph
- k-colorable graph
- k-edge connected graph
- knot graph
- labeled graph
- labeled semantic graph
- levelized graph
- line graph
- linked pie-column graph
- line-symmetric graph
- lobe graph
- locally finite graph
- locally restricted graph
- logarithmic graph
- l-vertex connected graph
- maximal strongly singular graph
- mixed graph
- mixed column/line graph
- m-partite graph
- multidimensional graph
- mutually connected graph
- net graph
- network graph
- nonseparable graph
- numbered undirected graph
- one hundred percent column graph
- one-way graph
- operator graph
- oriented graph
- paired bar graph
- paired pie graph
- Pappus' graph
- Petersen graph
- phonetic graph
- picture graph
- pie graph
- planar graph
- plane graph
- point-symmetric graph
- proportional pie graph
- R-graph
- recursively structured graph
- reduced-flow graph
- region adjacency graph
- regular graph of degree n
- reproduction graph
- rigid circuit graph
- rooted graph
- scatter graph
- sectional graph
- self-complementary graph
- selt-negational signed graph
- semilogarithmic graph
- signal graph
- signal-flow graph
- signed graph
- signed labeled graph
- singular graph
- spanning graph
- stacked column graph
- star graph
- state graph
- strongly cyclically closed graph
- strongly cyclic edge connected graph
- subdivision graph
- symmetric graph
- total graph
- transaction graph
- transition graph
- transitive graph
- transmission graph
- tripartite graph
- two-dimensional lattice graph
- two-partite graph
- undirected graph
- unicyclic graph
- vertex critical graph
- vertical bar graph
- x-y graph -
14 graph
1) граф2) график; кривая || строить график; вычерчивать кривую3) диаграмма || представлять в виде диаграммы4) вчт. моносимвольная графема, граф•- alternating graph
- alternating-composition graph
- animated bar graph
- area graph
- associated undirected graph
- atomic graph
- attachment graph
- balanced signed graph
- bar graph
- basis graph
- bicolorable graph
- bicolored graph
- bipartite graph
- block graph
- bunch graph
- Cayley's graph
- circuit closed graph
- circuit connected graph
- circuit-free graph
- clique graph
- color graph
- colored graph
- column graph
- columnar graph
- communication graph
- complete graph
- connected graph
- converse graph
- coordinate graph
- critical graph
- current graph
- cyclic graph
- data flow graph
- Desargues' graph
- descendence graph
- directed graph
- dual Y-axis graph
- Euler graph
- Eulerian graph
- even graph
- exclusion graph
- exploded pie graph
- finite graph
- flat graph
- fractal graph
- function graph
- fuzzy graph
- general graph
- graceful graph
- graph of contiguous channels
- graph of strictly partial order
- Hamilton graph
- Hamiltonian graph
- high/low/close/open graph
- HLCO graph
- horizontal bar graph
- identity graph
- implication graph
- infinite graph
- interaction graph
- interchange graph
- interval graph
- isomorphic graph
- k-chromatic graph
- k-colorable graph
- k-edge connected graph
- knot graph
- labeled graph
- labeled semantic graph
- levelized graph
- line graph
- line-symmetric graph
- linked pie-column graph
- lobe graph
- locally finite graph
- locally restricted graph
- logarithmic graph
- l-vertex connected graph
- maximal strongly singular graph
- mixed column/line graph
- mixed graph
- m-partite graph
- multidimensional graph
- mutually connected graph
- net graph
- network graph
- nonseparable graph
- numbered undirected graph
- one hundred percent column graph
- one-way graph
- operator graph
- oriented graph
- paired bar graph
- paired pie graph
- Pappus' graph
- Petersen graph
- phonetic graph
- picture graph
- pie graph
- planar graph
- plane graph
- point-symmetric graph
- proportional pie graph
- recursively structured graph
- reduced-flow graph
- region adjacency graph
- regular graph of degree n
- reproduction graph
- R-graph
- rigid circuit graph
- rooted graph
- scatter graph
- sectional graph
- self-complementary graph
- selt-negational signed graph
- semilogarithmic graph
- signal graph
- signal-flow graph
- signed graph
- signed labeled graph
- singular graph
- spanning graph
- stacked column graph
- star graph
- state graph
- strongly cyclic edge connected graph
- strongly cyclically closed graph
- subdivision graph
- symmetric graph
- total graph
- transaction graph
- transition graph
- transitive graph
- transmission graph
- tripartite graph
- two-dimensional lattice graph
- two-partite graph
- undirected graph
- unicyclic graph
- vertex critical graph
- vertical bar graph
- x-y graphThe New English-Russian Dictionary of Radio-electronics > graph
-
15 реберно связный граф
Большой англо-русский и русско-английский словарь > реберно связный граф
-
16 node
1) узела) соединение методом завязывания или его результат; затянутая петляб) утолщение; вздутие; нарост; выступг) особая точка кривой, точка кривой с несколькими касательнымим) контактный вывод (напр. на печатной плате)2) вчт гипертекстовый документ3) вчт категориальная часть лингвистической пометы•- access feeder node
- accessible from A-node
- adjacent node
- ancestor node
- ascending node
- base node
- bottom node
- brother nodes
- child node
- clock node
- connected nodes
- current node
- datum node
- daughter node
- descendant node
- descending node
- drain node
- electric node
- end node
- even node
- external node
- father node
- final node
- graph node
- hypertext node
- incident to edge node
- initial node
- integrated branch node
- internal node
- isolated node
- labeled node
- leaf node
- magnetic node
- major node
- network node
- north node
- odd node
- packet switch node
- packet switching node
- parent node
- partial node
- radio node
- reference node
- sibling nodes
- sink node
- sinoatrial node
- source node
- south node
- stable node
- star node
- star-shaped node
- switching node
- terminal node
- tip node
- tree node
- unlabeled node
- unstable node
- user node
- voltage node
- wave node
- wavefront node
- whole node
- winning node -
17 node
1) узела) соединение методом завязывания или его результат; затянутая петляб) утолщение; вздутие; нарост; выступг) особая точка кривой, точка кривой с несколькими касательнымим) контактный вывод (напр. на печатной плате)р) бион. скопление клеток или тканей одного типа в другой среде2) вчт. гипертекстовый документ3) вчт. категориальная часть лингвистической пометы•- accessible from A node
- adjacent node
- ancestor node
- ascending node
- base node
- bottom node
- brother nodes
- child node
- clock node
- connected nodes
- current node
- datum node
- daughter node
- descendant node
- descending node
- drain node
- electric node
- end node
- even node
- external node
- father node
- final node
- graph node
- hypertext node
- incident to edge node
- initial node
- integrated branch node
- internal node
- isolated node
- labeled node
- leaf node
- magnetic node
- major node
- network node
- node of Ranvier
- north node
- odd node
- packet switch node
- packet switching node
- parent node
- partial node
- radio node
- reference node
- sibling nodes
- sink node
- sinoatrial node
- source node
- south node
- stable node
- star node
- star-shaped node
- switching node
- terminal node
- tip node
- tree node
- unlabeled node
- unstable node
- user node
- voltage node
- wave node
- wavefront node
- whole node
- winning nodeThe New English-Russian Dictionary of Radio-electronics > node
-
18 path
1) путь; трасса2) траектория3) канал; тракт4) дорожка ( магнитной ленты)5) вчт ветвь (программы)6) цепь ( в электрической схеме)7) путь доступа8) контур•- path of a projectile- ray path
См. также в других словарях:
K-edge-connected graph — In graph theory, a graph G with edge set E(G) is said to be k edge connected if G setminus X is connected for all X subseteq E(G) with left| X ight| < k. In plain English, a graph is k edge connected if the graph remains connected when you delete … Wikipedia
K-vertex-connected graph — In graph theory, a graph G with vertex set V(G) is said to be k vertex connected (or k connected) if G setminus X is connected for all X subseteq V(G) with left| X ight| < k. In plain English, a graph is k connected if the graph remains connected … Wikipedia
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
graph theory — Math. the branch of mathematics dealing with linear graphs. [1965 70] * * * Mathematical theory of networks. A graph consists of nodes (also called points or vertices) and edges (lines) connecting certain pairs of nodes. An edge that connects a… … Universalium
Edge-graceful labeling — In graph theory, an edge graceful graph labeling is a type of graph labeling. This is a labeling for simple graphs , namely ones in which no two distinct edges connect the same two distinct vertices, no edge connects a vertex to itself, and the… … Wikipedia
Graph of groups — In geometric group theory, a graph of groups is an object consisting of a collection of groups indexed by the vertices and edges of a graph, together with a family of injective homomorphisms of the edge groups into the vertex groups.There is a… … Wikipedia
Nauru graph — The Nauru graph is Hamiltonian. Vertices 24 Edges 36 Radius 4 … Wikipedia
Edge contraction — In graph theory, an edge contraction is an operation which removes an edge from a graph while simultaneously merging together the two vertices it previously connected. Edge contraction is a fundamental operation in the theory of graph minors.… … Wikipedia
Coxeter graph — This article is about the 3 regular graph. For the graph associated with a Coxeter group, see Coxeter diagram. Coxeter graph The Coxeter graph Vertices 28 Edges 42 … Wikipedia
Holt graph — In the Holt graph, all vertices are equivalent, and all edges are equivalent, but edges are not necessarily equivalent to their inverses. Named after Derek F. Holt Vertices 27 … Wikipedia